Deterministic #-rewriting Systems
نویسندگان
چکیده
This paper discusses a deterministic version of #-rewriting systems with context-free rules. It demonstrates that classical form of determinism does not affect the generative power of #rewriting systems. The result concerning deterministic #-rewriting systems of index k is given too. The conclusion discusses even the stronger type of determinism.
منابع مشابه
Sound Structure-Preserving Transformation for Weakly-Left-Linear Deterministic Conditional Term Rewriting Systems
In this paper, we show that the SR transformation, a computationally equivalent transformation proposed by Şerbănuţă and Roşu, is a sound structure-preserving transformation for weakly-left-linear deterministic conditional term rewriting systems. More precisely, we show that every weakly-leftlinear deterministic conditional term rewriting system can be converted to an equivalent weakly-leftline...
متن کاملDeterminization of conditional term rewriting systems
This paper discusses determinization of conditional term rewriting systems with oriented constructor rules. We present a rule-based transformation system, which transforms a non-deterministic one into a deterministic one, together with examples of the transformation. We prove that the transformation system is simulation sound and simulation complete. We also prove that the transformation system...
متن کاملOn Proving and Characterizing Operational Termination of Deterministic Conditional Rewrite Systems
We define the notion of context-sensitive quasi-reductivity which implies operational termination of deterministic conditional term rewriting systems. Furthermore, we show how existing transformations from such systems into unconditional ones can be used (with slight modifications) to prove context-sensitive quasi-reductivity. Finally, we give a few equivalent characterizations of this notion.
متن کاملELAN : A logical framework based
ELAN implements computational systems, a concept that combines rewriting logic with the powerful description of rewriting strategies. ELAN can be used either as a logical framework or to describe and execute deterministic as well as non-deterministic rule based processes. We present the general features of the language and outline some of the applications it has been used for.
متن کاملELAN: A logical framework based on computational systems
ELAN implements computational systems, a concept that combines rewriting logic with the powerful description of rewriting strategies. ELAN can be used either as a logical framework or to describe and execute deterministic as well as non-deterministic rule based processes. We present the general features of the language and outline some of the applications it has been used for.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007